On the Independent Domination Number of Random Regular Graphs

نویسندگان

  • William Duckworth
  • Nicholas C. Wormald
چکیده

A dominating set D of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either in v ∈ D or there exists a vertex u ∈ D that is adjacent to v. We are interested in finding dominating sets of small cardinality. A dominating set I of a graph G is said to be independent if no two vertices of I are connected by an edge of G. The size of a smallest independent dominating set of a graph G is the independent domination number of G. In this paper we present upper bounds on the independent domination number of random regular graphs. This is achieved by analysing the performance of a randomised greedy algorithm on random regular graphs using differential equations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On independent domination numbers of grid and toroidal grid directed graphs

A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...

متن کامل

Independent domination in directed graphs

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...

متن کامل

Domination and Signed Domination Number of Cayley Graphs

In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.

متن کامل

On the super domination number of graphs

The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...

متن کامل

Some Results on the Maximal 2-Rainbow Domination Number in Graphs

A 2-rainbow dominating function ( ) of a graph  is a function  from the vertex set  to the set of all subsets of the set  such that for any vertex  with  the condition  is fulfilled, where  is the open neighborhood of . A maximal 2-rainbow dominating function on a graph  is a 2-rainbow dominating function  such that the set is not a dominating set of . The weight of a maximal    is the value . ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Combinatorics, Probability & Computing

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2006